Realization of Multi-Delay Filter Using Fermat Number Transforms
نویسندگان
چکیده
This paper is about an efficient implementation of adaptive filtering for echo cancelers. The first objective of this paper is to propose a simplified method of the flexible block Multi-Delay Filter (MDF) algorithm in the time-domain. Then, we will derive a new method for the stepsize adaptation coefficient. The second objective is about the realization of a Block Proportionate Normalized Least Mean Squares (BPNLMS++) with the simplified MDF (SMDF) implementation. Using the new step-size method and the smaller block dimension proposed by SMDF, we achieve a faster convergence of the adaptive process with a limited computational cost. Then, an efficient implementation of the new procedure (SMDFBPNLMS++) block filtering is proposed using Fermat Number Transform, which can significantly reduce the computation complexity of filter implantation on Digital Signal Processor. key words: adaptive filters, echo canceler, Fermat transforms
منابع مشابه
Realization of Block Adaptive Filters using Fermat Number Transforms
This paper is about an e¢cient implementation of adaptive ...ltering for echo cancelers. First, a realization of an improved Proportionate Normalized Least Mean Squares (PNLMS+ +) adaptive ...lter using block structure is presented. Then, an e¢cient implementation of the block ...ltering process is proposed using Number Theoretic Transforms (NTT) which can signi...cantly reduce the computation ...
متن کاملApproach to the hardware implementation of digital signal processors using Mersenne number transforms
In this paper Mersenne number transforms are converted into cyclic convolutions, in which form they are amendable to simple hardware interpretation. Such realisation structures are proposed that can make the computation of Mersenne number transforms very fast indeed. This new approach can be extended to the implementation of other number theoretic transforms, in particular to Fermat number tran...
متن کاملFast algorithms for 2-D circular convolutions and number theoretic transforms based on polynomial transforms over finite rings
In this paper, we develop new fast algorithms for 2-D integer circular convolutions and 2-D number theoretic transforms (NTT). These new algorithms, which offer improved computational complexity, are constructed based on polynomial transforms over 2, ; these transforms are Fourier-like transforms over Z1,[.r], which is the integral domain of polynomial forms over Z,. Having defined such polynom...
متن کاملGeneralized filter-bank equalizer for noise reduction with reduced signal delay
An efficient realization of a low delay filter-bank, termed as generalized filter-bank equalizer (FBE), will be proposed for noise reduction with low signal delay. The FBE is equivalent to a time-domain filter with coefficients adapted in the frequencydomain. This filter-bank structure ensures perfect signal reconstruction for a variety of spectral transforms with less restrictions than for an ...
متن کاملOn the computation of discrete Fourier transform using Fermat number transform
In the paper the results of a study using Fermat number transforms (FNTs) to compute discrete Fourier transforms (DFTs) are presented. Eight basic FNT modules are suggested and used as the basic sequence lengths to compute long DFTs. The number of multiplications per point is for most cases not more than one, whereas the number of shift-adds is approximately equal to the number of additions in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 91-A شماره
صفحات -
تاریخ انتشار 2008